-
1 fast polynomial transform
English-Russian electronics dictionary > fast polynomial transform
-
2 transform
1) преобразование; отображение || преобразовывать(ся); отображать(ся)2) результат преобразования; образ; отображение3) трансформация; превращение; переход || трансформировать(ся); превращать(ся); переходить•- chirp-Z transform
- code transform
- columnwise transform
- continuous Fourier transform
- coordinate system transform
- cosine transform
- C-transform
- CP-transform
- CPT-transform
- data transform
- direct electronic Fourier transform
- direct Fourier transform
- discrete cosine transform
- discrete Fourier transform
- discrete Hartley transform
- discrete Hilbert transform
- discrete Laplace transform
- F-transform
- fast Fourier transform
- fast Hartley transform
- fast polynomial transform
- fast Walsh transform
- Fermat transform
- Fourier transform
- fractal transform
- Fresnel transform
- Golay transform
- gradient transform
- H-transform
- Hadamard transform
- Hartley transform
- hexagonal discrete Fourier transform
- Hilbert transform
- homomorphic transform
- image transform
- indirect discrete cosine transform
- inverse transform
- inverse discrete Fourier transform
- inverse Fourier transform
- inverse Laplace transform
- joint transform
- Karhunen-Loève transform
- Laplace transform
- linear transform
- long-time Fourier transform
- Lorentz transform
- Mersenne transform
- mode transform
- multirate Z-transform
- near-to-far field transform
- nonlinear transform
- odd discrete Fourier transform
- odd-frequency Fourier transform
- odd-time Fourier transform
- odd-time odd-frequency discrete Fourier transform
- optical Fourier transform
- optical Fresnel transform
- P-transform
- Poisson transform
- polynomial transform
- Radon transform
- rowwise transform
- S-transform
- slant transform
- smoothed coherence transform
- Sommerfeld's transform
- T-transform
- Taylor-Cauchy transform
- two-dimensional Fourier transform
- two-dimensional Hartley transform
- twofold Fourier transform
- Walsh-Hadamard transform
- wavelet transform
- W/H transform
- Winograd discrete Fourier transform
- Z-transform -
3 быстрое полиномиальное преобразование
Русско-английский словарь по электронике > быстрое полиномиальное преобразование
-
4 быстрое полиномиальное преобразование
Русско-английский словарь по радиоэлектронике > быстрое полиномиальное преобразование
-
5 operation
Англо-русский словарь по компьютерной безопасности > operation
-
6 algorithm
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия)- private cryptographic algorithmАнгло-русский словарь по компьютерной безопасности > algorithm
См. также в других словарях:
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Fast wavelet transform — The Fast Wavelet Transform is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended… … Wikipedia
Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… … Wikipedia
Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… … Wikipedia
Henri Nussbaumer — is a French engineer born in Paris, France in 1931.After graduating in 1954 from the Ecole Centrale Paris, he joined IBM in the Paris development laboratory where he initially worked on solid state circuits. In 1960, he transferred to the IBM… … Wikipedia
Arthur Rubin — Arthur Leonard Rubin (born 1956) is an American mathematician who has earned a place among the five top ranked undergraduate competitors (who are themselves not ranked against each other) in the William Lowell Putnam Competition four times… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Clenshaw–Curtis quadrature — and Fejér quadrature are methods for numerical integration, or quadrature , that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables x = cos θ and use a discrete… … Wikipedia
Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 … Wikipedia
